Linear Programming Stories
نویسنده
چکیده
The history of polyhedra, linear inequalities, and linear programming has many diverse origins. Polyhedra have been around since the beginning of mathematics in ancient times. It appears that Fourier was the first to consider linear inequalities seriously. This was in the first half of the 19 century. He invented a method, today often called Fourier-Motzkin elimination, with which linear programs can be solved, although this notion did not exist in his time. If you want to know anything about the history of linear programming, I strongly recommend consulting Schrijver’s book [5]. It covers all developments in deepest possible elaborateness. This section of the book contains some aspects that complement Schrijver’s historical notes. The origins of the interior point method for linear programming are explored as well as column generation, a methodology that has proved of considerable practical importance in linear and integer programming. The solution of the Hirsch conjecture is outlined, and a survey of the development of computer codes for the solution of linear (and mixed-integer) programs is given. And there are two articles related to the ellipsoid method to which I would like to add a few further details. According to the New York Times of November 7, 1979: “A surprise discovery by an obscure Soviet mathematician has rocked the world of mathematics . . . ”. This obscure person was L. G. Khachiyan who ingeniously modified an algorithm, the ellipsoid method, developed for nonlinear programming by N. Z. Shor, D. B. Yudin, and A. S. Nemirovskii and proved in a very short paper [3] that this method solves linear programs in polynomial time. This was indeed a sensation. The ellipsoid method is a failure in practical computation but turned out to be a powerful tool to show the polynomial time solvability of many optimization problems, see [2]. One step in the ellipsoid method is the computation of a least volume ellipsoid containing a given convex body. The story of the persons behind the result that this ellipsoid, the Löwner-John ellipsoid, is uniquely determined and has very interesting properties, is told in this section. A second important ingredient of Khachiyan’s modification is “clever rounding”. A best possible approximation of a real number by a rational number with a bounded denominator can be
منابع مشابه
Verification of Temporal Constraints in Continuous Time on Nondeterministic Stories
This paper proposes a language based on temporal logics to specify constraints on nondeterministic stories, generated by interactive storytelling systems, taking into account that time is continuous and branched. These constraints are checked, in real time, during story generation. Constraints to be checked are described by temporal formulas over the properties of the story. To make possible th...
متن کاملWeb-Based Learning with Non-linear Multimedia Stories
Stories and story-telling are a cultural achievement of significant relevance, even in modern times. Since ancient times stories have served to entertain and teach mankind to “transmit” knowledge from generation to generation. Story-telling ranges from simple aural narrations to traditional inter-generational discourse and, in modern times, workflow-oriented organizational learning. Web-based s...
متن کاملSome Duality Results in Grey Linear Programming Problem
Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...
متن کاملSolving fully fuzzy linear programming
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear programming (abbreviated to FFLP) problems. Also, we employ linear programming (LP) with equality constraints to find a nonegative fuzzy number vector x which satisfies Ax =b, where A is a fuzzy number matrix. Then we investigate the existence of a positive solution of fully fuzzy linear system (FFLS).
متن کاملBILEVEL LINEAR PROGRAMMING WITH FUZZY PARAMETERS
Bilevel linear programming is a decision making problem with a two-level decentralized organization. The textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. Making a decision at one level affects that at the other one. In this paper, bilevel linear programming with inexact parameters has been studied and a method is...
متن کاملA New Approach to Solve Fully Fuzzy Linear Programming with Trapezoidal Numbers Using Conversion Functions
Recently, fuzzy linear programming problems have been considered by many. In the literature of fuzzy linear programming several models are offered and therefore some various methods have been suggested to solve these problems. One of the most important of these problems that recently has been considered; are Fully Fuzzy Linear Programming (FFLP), which all coefficients and variables of the prob...
متن کامل